def n_min(a_list,low,high):
    if low >=high:
        return a_list[low]
    mid = (low + high)//2
    left_min = n_min(a_list,low,mid)
    right_min = n_min(a_list,mid+1,high)
    if left_min < right_min:
        return left_min
    else:
        return right_min
num=[1,2,3,4,5]
print(n_min(num,1,1))